musli
Müsli is a flexible and generic binary serialization framework.
The central components of the framework are the Encode and Decode derives. They are thoroughly documented in the derives module.
I've chosen to internally use the term "encoding", "encode", and "decode" because it's common terminology when talking about binary formats. It's also distinct from serde's use of "serialization" allowing for the ease of using both libraries side by side if desired.
Design
Müsli is designed with similar principles as serde. Relying on Rust's powerful trait system to generate code which can largely be optimized away. The end result should be very similar to a handwritten encoding.
The heavy lifting in user code is done through the Encode and Decode derives. They are both documented in the derives module.
Where Müsli differs in approach is that we don't make as heavy use of the visitor pattern. Instead the encoding interacts with the framework through encoding interfaces that describe "what it wants" and leverages GATs to make the API efficient and ergonomic.
Another major aspect where Müsli differs is in the conept of modes. This is a larger topic and is covered further down.
Usage
Add the following to your Cargo.toml
:
= "0.0.41"
= "0.0.41"
Formats
Formats are currently distinguished by supporting various degrees of upgrade stability. A fully upgrade stable encoding format must tolerate that one model can add fields that an older version of the model should be capable of ignoring.
Partial upgrade stability can still be useful as is the case of the
musli-storage format below, because reading from storage only requires
decoding to be upgrade stable. So if correctly managed with
#[musli(default)]
this will never result in any readers seeing unknown
fields.
The available formats and their capabilities are:
reorder? | missing? | unknown? | self? | |
---|---|---|---|---|
musli-storage #[musli(packed)] |
✗ | ✗ | ✗ | ✗ |
musli-storage | ✔ | ✔ | ✗ | ✗ |
musli-wire | ✔ | ✔ | ✔ | ✗ |
musli-descriptive | ✔ | ✔ | ✔ | ✔ |
reorder?
determines whether fields must occur in exactly the order in
which they are specified. So reordering fields in such a struct would cause
either an error or some kind of undefined behavior. This is only suitable
for byte-oriented IPC where data models are strictly synchronized.
missing?
determines if reading can handle missing fields, as exemplified
above. This is suitable for on-disk storage.
unknown?
determines if the format can skip over unknown fields. This is
suitable for network communication. At this point you've reached upgrade
stability. Some level of introspection is possible on this level, because
it must contain enough information about fields to know what to skip which
usually allows for reasoning about basic types.
self?
determines if the format is self-descriptive. Allowing field names
and variants to be fully reconstructed from the serialized data. These
formats do not require models to decode, and can make use of generic
containers such as musli-value.
For every feature you drop, the format becomes more compact and efficient.
musli-storage
#[musli(packed)]
for example is roughly as compact and
efficient as bincode while musli-wire is comparable to something like
protobuf*.
Examples
The following is an example of full upgrade stability using musli-wire:
use ;
let version2 = to_buffer?;
let version1: Version1 = decode?;
assert_eq!;
The following is an example of partial upgrade stability using musli-storage:
use ;
let version2 = to_buffer?;
assert!;
let version1 = to_buffer?;
let version2: Version2 = decode?;
assert_eq!;
Modes
In Müsli the same model can be serialized in different ways. Instead of requiring the use of multiple models, we instead support each model implementing different modes.
A mode allows for different encoding attributes to apply depending on which mode something is performed in. A mode can apply to any musli parameter giving you a lot of flexibility.
If a mode is not specified, an implementation will apply to all modes (M: Mode
), if at least one mode is specified it will be implemented for all
modes which are present in a model and DefaultMode
. This way, an
encoding which uses DefaultMode
(which it does by default) should always
work.
use ;
use ;
use Encoding;
let CONFIG: = new;
let ALT_CONFIG: = new;
let word = Word ;
let out = CONFIG.to_string?;
assert_eq!;
let word2 = CONFIG.from_str?;
assert_eq!;
let out = ALT_CONFIG.to_string?;
assert_eq!;
let word2 = ALT_CONFIG.from_str?;
assert_eq!;
Unsafety
This library currently has two instances of unsafe:
-
A
mem::transcode
inTag::kind
. Which guarantees that converting into theKind
enum which is#[repr(u8)]
is as efficient as possible. (Soon to be replaced with an equivalent safe variant). -
A largely unsafe
SliceReader
which provides more efficient reading than the defaultReader
impl for&[u8]
does (which uses split_at). Since it can perform most of the necessary comparisons directly on the pointers.
Performance
The following are the results of preliminary benchmarking and should be taken with a big grain of 🧂.
Preliminary benchmarking indicates that Müsli roundtrip encodings for large
objects are about 10x faster than using JSON through serde, 5x faster than
serde_cbor
, and 12% faster than bincode. Note that the JSON comparison
obviously isn't apples-to-apples since the Müsli encoding isn't
self-descriptive, but it's included here to give a general idea of how it
compares. CBOR and bincode on the other hand have comparable
configurations.
For small objects the difference in encoding performance is even more significant. Müsli producing code that's 100x faster than JSON and CBOR, 20x faster than bincode (despite doing similarly oversized pre-allocation). This holds for both the wire and storage format.
json/roundtrip-large time: [91.263 us 91.756 us 92.239 us]
cbor/roundtrip-large time: [51.289 us 51.696 us 52.215 us]
bincode/roundtrip-large time: [10.225 us 10.328 us 10.431 us]
musli-storage/roundtrip-large
time: [9.0467 us 9.0881 us 9.1329 us]
musli-wire/roundtrip-large
time: [11.906 us 11.933 us 11.964 us]
cbor/roundtrip-small time: [138.40 ns 147.94 ns 158.60 ns]
json/roundtrip-small time: [137.06 ns 137.93 ns 139.16 ns]
bincode/roundtrip-small time: [16.978 ns 17.425 ns 18.057 ns]
musli-wire/roundtrip-small
time: [1.0177 ns 1.0227 ns 1.0277 ns]
musli-storage/roundtrip-small
time: [802.38 ps 803.95 ps 805.65 ps]
Note that these bencmarks include no "waste", like extra unrecognized fields. This is an area where Müsli's current encoding indeed is expected to lag behind since it needs to perform a fair bit of work to walk over unrecognized data.